Generalized measures of fault tolerance in exchanged hypercubes

Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets

In this paper, we study fault tolerance measures for m-ary n-dimensional hypercubes based on the concept of forbidden faulty sets. In a forbidden faulty set, certain nodes cannot be faulty at the same time and this model can better reflect fault patterns in a real system than the existing ones. Specifically, we study the bounds of the minimum vertex cut set for m-ary n-dimensional hypercubes by...

TCN: Scalable Hierarchical Hypercubes

Hierarchical hypercubes, such as Extended Hypercube (EH), Hyperweave (HW), and Extended Hypercube with Cross Connections (EHC), have been proposed to overcome the scalability limitation of conventional hypercubes through the use of fixed dimension hypercubes of processing elements (PEs) as basic modules interconnected by network controllers (NC) which are themselves interconnected into hypercub...

Restricted connectivity for three families of interconnection networks

Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity and super-connectivity, the concept of restricted vertex connectivity and restricted edge connectivity of graphs was proposed by Esfahanian [A.H. Es...

Multiple-Edge-Fault Tolerance with Respect to Hypercubes

Previous works on edge-fault tolerance with respect to hypercubes Qn are mainly focused on 1-edge fault and 2or 3edge fault with limited size of n. We give a construction scheme for 2-EFT(Qn) graphs and 3-EFT(Qn) graphs, where n is arbitrarily large. In our constructions, approximately log n extra degree is added to the vertices of Qn for 2-edge-fault tolerance, and one more degree for 3-edge-f...

Edge-fault-tolerant properties of hypercubes and folded hypercubes